WORST_CASE(?,O(n^3))

Solution:
---------

  "0" :: [] -(0)-> "A"(7, 6, 7)
  "0" :: [] -(0)-> "A"(2, 0, 0)
  "0" :: [] -(0)-> "A"(1, 1, 0)
  "0" :: [] -(0)-> "A"(0, 0, 0)
  "add" :: ["A"(2, 0, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "cons" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "dbl" :: ["A"(2, 0, 0)] -(1)-> "A"(0, 0, 0)
  "first" :: ["A"(1, 1, 0) x "A"(0, 0, 0)] -(1)-> "A"(0, 0, 0)
  "nil" :: [] -(0)-> "A"(0, 0, 0)
  "recip" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "s" :: ["A"(13, 13, 7)] -(7)-> "A"(7, 6, 7)
  "s" :: ["A"(2, 0, 0)] -(2)-> "A"(2, 0, 0)
  "s" :: ["A"(2, 1, 0)] -(1)-> "A"(1, 1, 0)
  "s" :: ["A"(0, 0, 0)] -(0)-> "A"(0, 0, 0)
  "sqr" :: ["A"(7, 6, 7)] -(1)-> "A"(0, 0, 0)
  "terms" :: ["A"(7, 6, 7)] -(2)-> "A"(0, 0, 0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(4, 4, 0)
  "0" :: [] -(0)-> "A"_cf(2, 1, 1)
  "0" :: [] -(0)-> "A"_cf(2, 0, 0)
  "0" :: [] -(0)-> "A"_cf(4, 0, 0)
  "0" :: [] -(0)-> "A"_cf(0, 0, 0)
  "0" :: [] -(0)-> "A"_cf(1, 1, 1)
  "add" :: ["A"_cf(2, 0, 0) x "A"_cf(2, 0, 0)] -(1)-> "A"_cf(2, 0, 0)
  "add" :: ["A"_cf(0, 0, 0) x "A"_cf(0, 0, 0)] -(1)-> "A"_cf(0, 0, 0)
  "dbl" :: ["A"_cf(4, 0, 0)] -(1)-> "A"_cf(2, 0, 0)
  "dbl" :: ["A"_cf(0, 0, 0)] -(1)-> "A"_cf(0, 0, 0)
  "s" :: ["A"_cf(8, 4, 0)] -(4)-> "A"_cf(4, 4, 0)
  "s" :: ["A"_cf(2, 0, 0)] -(2)-> "A"_cf(2, 0, 0)
  "s" :: ["A"_cf(4, 0, 0)] -(4)-> "A"_cf(4, 0, 0)
  "s" :: ["A"_cf(0, 0, 0)] -(0)-> "A"_cf(0, 0, 0)
  "sqr" :: ["A"_cf(4, 4, 0)] -(1)-> "A"_cf(2, 0, 0)


Base Constructors:
------------------